Implicational paradoxes and the meaning of logical constants
نویسنده
چکیده
We discuss paradoxes of implication in the setting of a proof-conditional theory of meaning for logical constants. We argue that a proper logic of implication should be not only relevant, but also constructive and nonmonotonic. This leads us to select as a plausible candidate LL, a fragment of linear logic which differs from R in that it rejects both contraction and
منابع مشابه
Logical Consequence and the Paradoxes
We group the existing variants of the familiar set-theoretical and truththeoretical paradoxes into two classes: connective paradoxes, which can in principle be ascribed to the presence of a contracting connective of some sort, and structural paradoxes, where at most the faulty use of a structural inference rule can possibly be blamed. We impute the former to an equivocation over the meaning of ...
متن کاملEntailment Calculus as a Logical Tool for Reasoning Rule Generation and Verification
A common inadequacy of current knowledge-based systems is that they cannot reason about those situations and/or problems that have not been considered by their developers. A major cause of this inadequacy is that the system cannot automatically generate new and valid reasoning rules from those existing rules and facts that are programmed or inputted in the systems by their developers or users. ...
متن کاملSemantic consistency proofs for systems of illative combinatory logic
Illative systems of combinatory logic or lambda-calculus consist of type-free combinatory logic or lambda-calculus extended with additional constants intended to represent logical notions. In fact, early systems of combinatory logic and lambda calculus (by Schönfinkel [15], Curry [4] and Church [2, 3]) were meant as very simple foundations for logic and mathematics. However, the Kleene-Rosser a...
متن کاملThe paradoxes and Russell’s theory of incomplete symbols
Russell claims in his autobiography and elsewhere that he discovered his 1905 theory of descriptions while attempting to solve the logical and semantic paradoxes plaguing his work on the foundations of mathematics. In this paper, I hope to make the connection between his work on the paradoxes and the theory of descriptions and his theory of incomplete symbols generally clearer. In particular, I...
متن کاملFunctional Dependencies in a Relational Data Base and Propositional Logic
An equivalence is shown between functional dependency statements of a relational database, where “+” has the meaning of “determines,” and implicational statements of propositional logic, where “.$” has the meaning of “implies.” Specifically, it is shown that a dependency statement is a consequence of a set of dependency statements iff the corresponding implicational statement is a consequence o...
متن کامل